The Bernstein Basis and Real Root Isolation
نویسندگان
چکیده
In this mostly expository paper we explain how the Bernstein basis, widely used in computer-aided geometric design, provides an efficient method for real root isolation, using de Casteljau’s algorithm. We discuss the link between this approach and more classical methods for real root isolation. We also present a new improved method for isolating real roots in the Bernstein basis inspired by Roullier and Zimmerman.
منابع مشابه
On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers
We elaborate on a correspondence between the coefficients of a multivariate polynomial represented in the Bernstein basis and in a tensor-monomial basis, which leads to homography representations of polynomial functions, that use only integer arithmetic (in contrast to Bernstein basis) and are feasible over unbounded regions. Then, we study an algorithm to split this representation and we obtai...
متن کاملNumerical solution of nonlinear Hammerstein integral equations by using Legendre-Bernstein basis
In this study a numerical method is developed to solve the Hammerstein integral equations. To this end the kernel has been approximated using the leastsquares approximation schemes based on Legender-Bernstein basis. The Legender polynomials are orthogonal and these properties improve the accuracy of the approximations. Also the nonlinear unknown function has been approximated by using the Berns...
متن کاملA formal study of Bernstein coefficients and polynomials
Bernstein coe cients provide a discrete approximation of the behavior of a polynomial inside an interval. This can be used for example to isolate real roots of polynomials. We prove a criterion for the existence of a single root in an interval and the correctness of the de Casteljau algorithm to compute e ciently Bernstein coe cients. Key-words: Polynomials, de Casteljau, Bernstein polynomials,...
متن کاملReal root isolation for exact and approximate polynomials using Descartes' rule of signs
Collins und Akritas (1976) have described the Descartes method for isolating the real roots of an integer polynomial in one variable. This method recursively subdivides an initial interval until Descartes’ Rule of Signs indicates that all roots have been isolated. The partial converse of Descartes’ Rule by Obreshkoff (1952) in conjunction with the bound of Mahler (1964) and Davenport (1985) lea...
متن کاملNumerical resolution of large deflections in cantilever beams by Bernstein spectral method and a convolution quadrature.
The mathematical modeling of the large deflections for the cantilever beams leads to a nonlinear differential equation with the mixed boundary conditions. Different numerical methods have been implemented by various authors for such problems. In this paper, two novel numerical techniques are investigated for the numerical simulation of the problem. The first is based on a spectral method utiliz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004